#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n,d;cin>>n>>d;

      LL f=sqrt(d);
      bool flag=0;
      for(LL i=0;i<=f;i++){
          LL p=i+1;
          if(i+((d+p-1)/p)<=n){
            flag=1;break;
          }
      }
      if(flag){
         cout<<"YES"<<"\n";
      }
      else{
         cout<<"NO"<<"\n";
      }
   }
   return 0;
}
